Network sensitivity to hot-potato disruptions

A BGP Solver for Hot-Potato Routing Sensitivity Analysis

The interactions between the IGP and BGP routing protocols which are running inside an ISP’s network are sometimes hard to understand. The problem becomes particularly complex when there are dozens of routers/links and several thousands of destination prefixes. In this paper, we present a publicly available routing solver to evaluate routing what-if scenarios. The solver is able to model the co...

Deterministic Many-to-Many Hot Potato Routing

We consider algorithms for many-to-many hot potato routing. In hot potato (deflection) routing a packet cannot be buffered, and is therefore always moving until it reaches its destination. We give optimal and nearly optimal deterministic algorithms for many-tomany packet routing in commonly occurring networks such as the hypercube, meshes and tori of various dimensions and sizes, trees and hype...

A hot potato

A new story — the discovery that genetically engineered food damages the immune system — seems set to join the misleading half-truths so often paraded by the media in the campaign to convince us of the dangers of genetic manipulation. The concept originated with a BBC Television World in Action programme on 10 August, which described experiments in which Arpad Puztai of the Rowett Research Inst...

Scheduled Hot-Potato Routing

This paper is concerned with fast, hot-potato routing, performed according to a predetermined schedule. At each time period each node selects an outgoing link, through which an incoming packet is sent. No buffers are used. We investigate first the problem of how to route a network-wide demand of packets, given the predetermined schedule. We show that certain versions of the problem have efficie...

Randomized Greedy Hot-Potato Routing